Optimal query complexity bounds for finding graphs
نویسندگان
چکیده
منابع مشابه
Optimal Query Complexity for Reconstructing Hypergraphs
In this paper we consider the problem of reconstructing a hidden weighted hypergraph of constant rank using additive queries. We prove the following: Let G be a weighted hidden hypergraph of constant rank with n vertices and m hyperedges. For any m there exists a non-adaptive algorithm that finds the edges of the graph and their weights using O „
متن کاملOptimal Complexity Bounds for Positive LTL Games
We prove two tight bounds on complexity of deciding graph games with winning conditions defined by formulas from fragments of LTL. Our first result is that deciding LTL+(3,∧,∨) games is in PSPACE. This is a tight bound: the problem is known to be PSPACE-hard even for the much weaker logic LTL+(3,∧). We use a method based on a notion of, as we call it, persistent strategy: we prove that in games...
متن کاملThe Query Complexity of Order-Finding
We consider the problem where is an unknown permutation on f0; 1; : : : ; 2n 1g, y0 2 f0; 1; : : : ; 2n 1g, and the goal is to determine the minimum r > 0 such that r(y0) = y0. Information about is available only via queries that yield x(y) from any x 2 f0; 1; : : : ; 2m 1g and y 2 f0; 1; : : : ; 2n 1g (where m is polynomial in n). The resource under consideration is the number of these queries...
متن کاملLower Bounds on Quantum Query Complexity
Shor’s and Grover’s famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers cannot do, and specifically how to prove limits on their computational power. We cover the main known techniques for proving lower bounds, and exemplify and compare ...
متن کاملOptimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs
This paper studies four combinatorial search models of reconstructing a fixed unknown Hamiltonian cycle in the complete graph by means of queries about subgraphs. For each model, an efficient algorithm is proposed that matches asymptotically the information-theoretic lower bound. The problem is motivated by an application to genome physical mapping.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2010
ISSN: 0004-3702
DOI: 10.1016/j.artint.2010.02.003